Prime ideal characterization of chain based lattices
نویسندگان
چکیده
منابع مشابه
Ideal Multilinear Maps based on Ideal Lattices
Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....
متن کاملIdeal Multilinear Maps Based on Ideal Lattices
Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....
متن کاملIdeal Lattices of Lattices
This paper shows that any compactly generated lattice is a subdirect product of subdirectly irreducible lattices which are complete and upper continuous. An example of a compactly generated lattice which cannot be subdirectly decomposed into subdirectly irreducible compactly generated lattices is given. In the case of an ideal lattice of a lattice L, the decomposition into subdirectly irreducib...
متن کاملThe Dual of a Strongly Prime Ideal
Let R be a commutative integral domain with quotient field K and let P be a nonzero strongly prime ideal of R. We give several characterizations of such ideals. It is shown that (P : P) is a valuation domain with the unique maximal ideal P. We also study when P^{&minus1} is a ring. In fact, it is proved that P^{&minus1} = (P : P) if and only if P is not invertible. Furthermore, if P is invertib...
متن کاملDensity of Ideal Lattices
The security of many efficient cryptographic constructions, e.g. collision-resistant hash functions, digital signatures, identification schemes, and more recently public-key encryption has been proven assuming the hardness of worst-case computational problems in ideal lattices. These lattices correspond to ideals in the ring Z[ζ], where ζ is some fixed algebraic integer. Under the assumption th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1980
ISSN: 0263-6115
DOI: 10.1017/s1446788700021959